'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  first(0(), X) -> nil()
     , first(s(X), cons(Y)) -> cons(Y)
     , from(X) -> cons(X)}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  first^#(0(), X) -> c_0()
    , first^#(s(X), cons(Y)) -> c_1()
    , from^#(X) -> c_2()}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.